Counting Generalized Orders on Not Necessarily Formally Real Fields

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Counting Generalized Orders on Not Necessarily Formally Real Fields

The set of classical orderings of a field compatible with a given place from the field to the real numbers is known to be bijective with the set of homomorphisms from the value group of the place into the two element group. This fact is generalized here to the set of “generalized orders” compatible with an “extended absolute value,” i.e., an absolute value allowed to take the value ∞. The set o...

متن کامل

On Generalized Interval Orders

In this paper, we introduce the notion of generalized interval order (GIO) which extends the notion of interval order in non-transitive binary relations. This allow us to extend the classical representation theorem of Fishburn in [5]. We also provide sufficient conditions which ensure the existence of the Generalized Optimal Choice Set (GOCS) of GIOs. Finally, we characterize the existence of t...

متن کامل

On Counting Generalized Colorings

The notion of graph polynomials definable in Monadic Second Order Logic, MSOL, was introduced in [Mak04]. It was shown that the Tutte polynomial and its generalization, as well as the matching polynomial, the cover polynomial and the various interlace polynomials fall into this category. In this paper we present a framework of graph polynomials based on counting functions of generalized colorin...

متن کامل

Equations for formally real meadows

We consider the signatures Σm = (0, 1,−,+, ·, ) of meadows and (Σm, s) of signed meadows. We give two complete axiomatizations of the equational theories of the real numbers with respect to these signatures. In the first case, we extend the axiomatization of zero-totalized fields by a single axiom scheme expressing formal realness; the second axiomatization presupposes an ordering. We apply the...

متن کامل

Generalized Priestley Quasi-Orders

We introduce generalized Priestley quasi-orders and show that subalgebras of bounded distributive meet-semilattices are dually characterized by means of generalized Priestley quasi-orders. This generalizes the well-known characterization of subalgebras of bounded distributive lattices by means of Priestley quasiorders (Adams, Algebra Univers 3:216–228, 1973; Cignoli et al., Order 8(3):299– 315,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Rocky Mountain Journal of Mathematics

سال: 2005

ISSN: 0035-7596

DOI: 10.1216/rmjm/1181069737